Quick Sort on SCMPDS1
نویسنده
چکیده
This means we cannot justify the correctness of the “Partition” subroutine by the Hoare’s axiom on program verification. This article is organized as follows. First, we present several fundamental properties of “while” program and finite sequence. Second, we define the “Partition” subroutine on SCMPDS, the task of which is to split a sequence into a smaller and a larger subsequence. The definition of quick sort on SCMPDS follows. Finally, we describe the basic property of the “Partition” and quick sort, and prove their correctness.
منابع مشابه
MQ Sort an Innovative Algorithm using Quick Sort and Merge Sort
Sorting is a commonly used operation in computer science. In addition to its main job of arranging lists or arrays in sequence, sorting is often also required to facilitate some other operation such as searching, merging and normalization or used as an intermediate operation in other operations. A sorting algorithm consists of comparison, swap, and assignment operations[1-3]. There are several ...
متن کاملQuick Sort on SCMPDS
This means we cannot justify the correctness of the “Partition” subroutine by the Hoare’s axiom on program verification. This article is organized as follows. First, we present several fundamental properties of “while” program and finite sequence. Second, we define the “Partition” subroutine on SCMPDS, the task of which is to split a sequence into a smaller and a larger subsequence. The definit...
متن کاملAn Efficient Quicksort using Value based Pivot Selection an Bidirectional Partitioning
Quick sort is generally considered to be the best internal sorting algorithm, and is often used as a yardstick by which the efficiency of other sorting algorithms is compared. It is, therefore essential that its performance is studied thoroughly. This includes studying the worst case behaviour of the algorithm, and especially when the algorithm is experimentally evaluated. The worst case runnin...
متن کاملA Comparative Study on Different Types of Sorting Algorithms (On the Basis of C and Java)
Sorting is used for arranging the data in some sequence like increasing or decreasing order. I have discussed about various sorting algorithm with their comparison to each other in basis of time complexity and space complexity as well as C and Java. These papers also show running time of algorithm with the help of C language and Java. I have compared some types of sorting algorithm like inserti...
متن کاملCharacterizing the Sort Operation on Multithreaded Architectures
The Sort operation is a core part of many critical applications. Despite the large efforts to parallelize it, the fact that it suffers from high data-dependencies vastly limits its performance. Multithreaded architectures are emerging as the most demanding technology in leading-edge processors. These architectures include Simultaneous Multithreading, Chip Multiprocessors and machines combining ...
متن کامل